Find common divisors between two numbersΒΆ
Find common divisors between two numbers in a given pair.
def ngcd(x, y):
i = 1
while(i <= x and i <= y):
if x % i == 0 and y % i == 0:
gcd = i;
i += 1
return gcd;
def num_comm_div(x, y):
n = ngcd(x, y)
result = 0
z = int(n**0.5)
i = 1
while i <= z:
if n % i == 0:
result += 2
if i == n/i:
result -= 1
i += 1
return result
print("Number of common divisors: ", num_comm_div(2, 4))
print("Number of common divisors: ", num_comm_div(2, 8))
print("Number of common divisors: ", num_comm_div(12, 24))
Output:
AP sequence, Next number of the sequence: 4
GP sequence, Next number of the sequence: 54.0
Wrong Numbers